LINK PREDICTION USING TENSOR DECOMPOSITION

نویسندگان

چکیده

In recent years, tensor decomposition has gained increasing interest in the field of link prediction, which aims to estimate likelihood new connections forming between nodes a network. This study highlights potential Canonical Polyadic enhancing prediction complex networks. It suggests effective algorithms that not only take into account structural characteristics network but also its temporal evolution. During process decomposition, initial is decomposed two-way tensors, known as factor matrices, representing different modes data. These matrices capture underlying patterns or relationships within network, providing insights structure and dynamics For evaluation, we examine dataset derived from WSDM. After preprocessing, data represented multi-way tensor, with each mode aspects such users, items, time. Our primary objective make precise predictions about links users items specific time periods. The experimental results demonstrate our approach significantly improves accuracy for evolving networks, measured by AUC.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Link Prediction on Evolving Data Using Tensor Factorization

Within the last few years a lot of research has been done on large social and information networks. One of the principal challenges concerning complex networks is link prediction. Most link prediction algorithms are based on the underlying network structure in terms of traditional graph theory. In order to design efficient algorithms for large scale networks, researchers increasingly adapt meth...

متن کامل

Link Prediction via Generalized Coupled Tensor Factorisation

This study deals with the missing link prediction problem: the problem of predicting the existence of missing connections between entities of interest. We address link prediction using coupled analysis of relational datasets represented as heterogeneous data, i.e., datasets in the form of matrices and higher-order tensors. We propose to use an approach based on probabilistic interpretation of t...

متن کامل

Link Prediction using Network Embedding based on Global Similarity

Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...

متن کامل

Link Prediction in Heterogeneous Networks Based on Tensor Facto- rization

Link Prediction, that is, predicting the formation of links or interactions in a network in the future, is an important task in network analysis. Link prediction provides useful insights for other applications, such as recommendation system, disease-gene candidate detection and so on. Most link prediction methods assume that there is only one single type in the network. However, many real-world...

متن کامل

Tensor-Based Link Prediction in Intermittently Connected Wireless Networks

Through several studies, it has been highlighted that mobility patterns in mobile networks are driven by human behaviors. This effect has been particularly observed in intermittently connected networks like DTN (Delay Tolerant Networks). Given that common social intentions generate similar human behavior, it is relevant to exploit this knowledge in the network protocols design, e.g. to identify...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: ?azak?stan-Britan tehnikalyk? universitetìnìn? habaršysy

سال: 2023

ISSN: ['1998-6688']

DOI: https://doi.org/10.55452/1998-6688-2023-20-2-92-102